On algorithms for (P5, gem)-free graphs

On the structure of (P5, gem)-free graphs

We give a complete structure description of (P 5 ,gem)-free graphs. By the results of a related paper, this implies bounded clique width for this graph class.

Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width

On (P5, diamond)-free graphs

We study the stability number, chromatic number and clique cover of graphs with no induced P5 and diamonds. In particular, we provide a way to obtain all imperfect (P5, diamond)-free graphs by iterated point multiplication or substitution from a /nite collection of small basic graphs. Corollaries of this and other structural properties, among which a result of Bacs1 o and Tuza, are (i) combinat...

Independent Set in P5-Free Graphs in Polynomial Time

The Independent Set problem is NP-hard in general, however polynomial time algorithms exist for the problem on various specific graph classes. Over the last couple of decades there has been a long sequence of papers exploring the boundary between the NPhard and polynomial time solvable cases. In particular the complexity of Independent Set on P5-free graphs has received significant attention, a...

Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs